Data processing

ABSTRACT

A computer-processor-implemented data processing method comprises: a computer processor executing instances of one or more processing functions, each instance of a processing function having an associated function-call identifier; and in response to initiation of execution by the computer processor of a given processing function instance configured to modify one or more pointers of a partitioned acyclic data structure: the computer processor storing the function-call identifier for that processing function instance in a memory at a storage location associated with the partitioned acyclic data structure; for a memory location which stores data representing a given pointer of the partitioned acyclic data structure, the computer processor defining a period of exclusive access to at least that memory location by applying and subsequently releasing an exclusive tag for at least that memory location; and the computer processor selectively processing the given pointer during the period of exclusive access in dependence upon whether the function-call identifier of the prevailing processing function instance is identical to the function-call identifier stored in association with the partitioned acyclic data structure.

BACKGROUND

This disclosure relates to data processing methods and apparatus.

In a data processing system handling partitioned acyclic data structuressuch as linked lists, if a processor exception, interrupt or the likeoccurs while the data processing system is engaged in making a change tothe partitioned acyclic data structure (for example, adding or deletingan element of the partitioned acyclic data structure), there can bepotential problems relating to maintaining the integrity and correctstructure of the resulting partitioned acyclic data structure.

It is desirable to alleviate such issues.

SUMMARY

In an example arrangement there is provided acomputer-processor-implemented data processing method comprising:

a computer processor executing instances of one or more processingfunctions, each instance of a processing function having an associatedfunction-call identifier; and

in response to initiation of execution by the computer processor of agiven processing function instance configured to modify one or morepointers of a partitioned acyclic data structure:

-   -   the computer processor storing the function-call identifier for        that processing function instance in a memory at a storage        location associated with the partitioned acyclic data structure;    -   for a memory location which stores data representing a given        pointer of the partitioned acyclic data structure, the computer        processor defining a period of exclusive access to at least that        memory location by applying and subsequently releasing an        exclusive tag for at least that memory location; and    -   the computer processor selectively processing the given pointer        during the period of exclusive access in dependence upon whether        the function-call identifier of the prevailing processing        function instance is identical to the function-call identifier        stored in association with the partitioned acyclic data        structure.

In another example arrangement there is provided a non-transitorymachine-readable storage medium which stores program instructions which,when executed by a computer processor, cause the computer processor toperform the steps of a method comprising:

executing instances of one or more processing functions, each instanceof a processing function having an associated function-call identifier;and

in response to initiation of execution of a given processing functioninstance configured to modify one or more pointers of a partitionedacyclic data structure:

-   -   storing the function-call identifier for that processing        function instance in association with the partitioned acyclic        data structure;    -   for a memory location storing data representing a given pointer        of the partitioned acyclic data structure, defining a period of        exclusive access to at least that memory location by applying        and subsequently releasing an exclusive tag for at least that        memory location; and    -   selectively processing the given pointer during the period of        exclusive access in dependence upon whether the function-call        identifier of the prevailing processing function instance is        identical to the function-call identifier stored in association        with the partitioned acyclic data structure.

In another example arrangement there is provided a data processorcomprising: processing circuitry configured, under the control of a setof processing instructions, to perform the steps of:

executing instances of one or more processing functions, each instanceof a processing function having an associated function-call identifier;and

in response to initiation of execution of a given processing functioninstance configured to modify one or more pointers of a partitionedacyclic data structure:

-   -   storing the function-call identifier for that processing        function instance in association with the partitioned acyclic        data structure;    -   for a memory location storing data representing a given pointer        of the partitioned acyclic data structure, defining a period of        exclusive access to at least that memory location by applying        and subsequently releasing an exclusive tag for at least that        memory location; and    -   selectively processing the given pointer during the period of        exclusive access in dependence upon whether the function-call        identifier of the prevailing processing function instance is        identical to the function-call identifier stored in association        with the partitioned acyclic data structure.

In another example arrangement there is provided a non-transitorymachine-readable storage medium which stores a partitioned acyclic datastructure comprises a set of linked data items, each data itemcomprising a memory location to store data representing a pointer to anext data item in the partitioned acyclic data structure; and whichprovides a data field associated with the partitioned acyclic datastructure to store a function-call identifier of an instance of aprocessing function in response to initiation of execution of thatprocessing function instance.

Further respective aspects and features of the present disclosure aredefined by the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The present technique will be described further, by way of example only,with reference to embodiments thereof as illustrated in the accompanyingdrawings, in which:

FIG. 1 schematically illustrates a data processing system;

FIG. 2 schematically illustrates a partitioned acyclic data structure;

FIG. 3 is a schematic state diagram illustrating aspects of a loadexclusive/store exclusive process;

FIG. 4 is a schematic flowchart illustrating a method;

FIGS. 5a to 5c illustrate operations relating to a so-called push_frontoperation to a partitioned acyclic data structure;

FIGS. 6a to 6c illustrate operations relating to a so-called pop_frontoperation to a partitioned acyclic data structure;

FIGS. 7a to 7c illustrate operations relating to a so-called insertoperation to a partitioned acyclic data structure;

FIGS. 8a to 8c illustrate operations relating to a so-called deleteoperation to a partitioned acyclic data structure;

FIGS. 9a to 9c illustrate operations relating to a so-called push_backoperation to a partitioned acyclic data structure;

FIGS. 10a to 10c illustrate operations relating to a so-called pop_backoperation to a partitioned acyclic data structure; and

FIG. 11 schematically illustrates a machine-readable non-transitorystorage medium.

DESCRIPTION OF EMBODIMENTS

Referring now to the drawings, FIG. 1 is a schematic diagram of a dataprocessing system 10 comprising a data processing apparatus 20 connectedto a memory arrangement 30.

The data processing apparatus 20 in this example comprises a processingelement or processor core 40 associated with or including an instructionpre-fetch unit 60 and exception logic 70. It is noted that other logicor components may be present, but these are not shown for clarity of thediagram.

The memory arrangement 30 comprises a main memory 80, and an instructioncache (I-cache) 90 disposed between the main memory 80 and the pre-fetchunit 60.

The pre-fetch unit 60 acts as a pipelined instruction fetching unitconfigured to fetch instructions from memory during a pipeline period oftwo or more processor clock cycles prior to execution of thoseinstructions by the processor core 40. Generally speaking, the pre-fetchunit 60 is configured to fetch instructions from the instruction cache90 or, if they are not present in the instruction cache, from the mainmemory 80 or any intervening cache levels (which, for simplicity of thediagram, are not shown in FIG. 1) and to route those instructions to adecoder of the processor core 40 for decoding.

The exception logic 70 handles so-called exceptions, and in particularis configured to respond to a detected processing exception having anexception type selected from a plurality of exception types, by storinga current processor status and diverting program flow to an exceptionaddress dependent upon the exception type so as to control theinstruction fetching unit to initiate fetching of an exceptioninstruction at the exception address. Other aspects of the handling ofexceptions will be discussed below.

During normal program flow, the program counter associated with theprocessor core 40 increases sequentially through the address space,unless a branch occurs to another address or a so-calledbranch-with-link occurs to make use of a subroutine. An exception occurswhen this normal flow of execution is diverted to allow the processor tohandle different events corresponding to internal or external items.These events might be (for example) externally generated interrupts 72,for example when a peripheral device requires a newly-captured data itemto be processed, or internally generated events 74 such as the processortrying to access an undefined or unallowable memory address. It is knownto handle multiple different exception types in different ways.

The processing element also accesses one or more registers contained ina register bank 85, the registers storing control information forcontrolling the operation of the processing element 40. The controlregisters may include registers such as a program counter (PC) registerfor indicating an address of an instruction corresponding to a currentpoint of execution, a stack pointer (SP) register indicating an addressof a location in the memory system 30 of a stack data structure forsaving/restoring register states when handling a processor exception,and a link register (LR) for storing a function return address for whichprocessing should branch following the execution of a function. It willof course be appreciated that these are just some of the types ofinformation which could be stored, and in practise a given instructionset architecture may store different or further control parameters asdefined by the architecture. One of the registers 87 is illustratedschematically as storing a variable which will be referred to in thediscussion below in a function-call identifier and which, in general,will change in response to calling of another processing function orexception handling routine. This may be, for example, the stack pointer,the link register or another register value. So, the register 87 couldbe a representation of the SP, or a representation of the LR, or arepresentation of another register. In general terms, the function-callidentifier for a processing function instance is an identifier selectedfrom the list consisting of:

a processor stack pointer associated with that processing functioninstance;

an identifier of a memory context allocated to that processing functioninstance;

a program counter value dependent upon an entry point of that processingfunction; and

a thread identifier combined with an interrupt identifier.

In general, any parameter or register value can be used as thefunction-call identifier, provided that it changes if another functionis called during the execution of a given function. In the example caseof the SP, if another function were called, further data would be pushedto the stack and so the SP would indeed change. A technique used inembodiments of the disclosure is to store the function-call identifier(for example, to a field or variable referred to below as “Caller ID”)before starting an exclusive access operation and then rechecking thatthe function-call identifier is still the same within the exclusiveaccess operation, showing that (if it is the same) another function hasnot been called between the start of the process and the execution ofthe exclusive access operation.

FIG. 2 schematically illustrates a partitioned acyclic data structurerepresenting a series of data items 200, 210, 220 . . . linked togetherby pointers 202, 212, 222 such that each pointer is arranged to indicatethe storage location of a next data item in the partitioned acyclic datastructure. In other words, the pointer 202 provides an indication of thelocation of the data item 210, and the pointer 212 provides anindication of the storage location of the data item 220.

A head data item 230 provides the starting point in the partitionedacyclic data structure and contains (potentially amongst other headerand administrative information) a pointer 232 giving the storagelocation of the first data item 200 in the partitioned acyclic datastructure.

The pointer 222 as drawn may point to a subsequent data item (not shownin FIG. 2) or, if the data item 220 is the last data item in thepartitioned acyclic data structure, may indicate that this is the “end”of the succession of data items.

The term “acyclic” indicates a property of the structure. In asingly-linked acyclic list structure, the last data item is not linkedback to any other (for example the first) data item in the structure.More generally, however, “acyclic” indicates that no data item linksback to itself through zero or more intermediate data items.

An example of a partitioned cyclic data structure of this form is aso-called linked list of data items.

Therefore, in the example of FIG. 2, the partitioned acyclic datastructure comprises a set of linked data items, each data itemcomprising a memory location to store data representing a pointer to anext data item in the partitioned acyclic data structure.

Example operations will be discussed below in which the computerprocessor 40 initiates and then executes a given processing functioninstance configured to modify one or more pointers of a partitionedacyclic data structure, for example to insert or delete elements or dataitems of the partitioned acyclic data structure.

An issue which could occur when such modifications are being made isthat the computer processor undertaking the modification is interruptedor otherwise diverted to another process or exception level while themodification is underway. This could potentially result in the modifiedversion being incorrect, if for example a further interveningmodification has taken place by the diverted or interrupt process.Techniques are discussed below to alleviate this issue, by providing arecord of a function calling identifier (which would change if anintervening function has been called) which is rechecked within a periodof exclusive access to the pointer being altered.

FIG. 3 is a schematic state diagram to illustrate aspects of a systeminvolving exclusive loads and stores.

Exclusive loads and stores are a known way to execute semaphores wherethe load and store operations are non-atomic. They are used in, forexample, the ARM11 MPCore Processor and the Arm v7-m instruction set,licensed by Arm Ltd. This feature enables operations to be performed onloaded data before storing it, with the system of exclusive loads andstores guaranteeing that if data that has been previously loaded by anexclusive load operation has been modified by another CPU or by anotherprocess, the subsequent exclusive store fails and the whole load-storesequence must be retried. The exclusive status can be reset or removedeither by successfully completing a store exclusive instruction or byexecuting a “clear exclusive” instruction. Exclusivity can apply to aspecific address which is the subject of the exclusive load operation,to a page or region including the address which is the subject of theexclusive load operation, or to the whole of an application addressspace including the address which is the subject of the exclusive loadoperation. In the present example, the exclusivity is to the addresswhich is the subject of the exclusive load operation, but in otherexamples the defining of a period of exclusivity comprises the computerprocessor applying and subsequently releasing an exclusive tag a rangeof memory locations including at least the memory location for the givenpointer.

Referring to FIG. 3, two states 300 (open access) and 310 (exclusiveaccess) as applicable to a memory or range of memory addresses areshown. Executing an exclusive load LDREX (with example parametersaddress, size) moves from the state 300 to the state 310. Executing anexclusive store STREX or a clear exclusive instruction transitions fromthe state 310 to the state 300. While in the state 310, executing anon-exclusive store STR or another exclusive load for a differentaddress range LDREX(x′, s′) means that the system stays in the state310.

By way of summary of the techniques to be discussed below, FIG. 4 is aschematic flowchart illustrating a computer-processor-implemented dataprocessing method (for example, implemented by the processing element 40of the data processor 20 of FIG. 1) comprising:

at a step 400, the computer processor 40 executing instances of one ormore processing functions, each instance of a processing function havingan associated function-call identifier; and

in response to initiation of execution by the computer processor (at astep 410) of a given processing function instance configured to modifyone or more pointers of a partitioned acyclic data structure:

-   -   the computer processor storing (at a step 420) the function-call        identifier for that processing function instance in a memory at        a storage location associated with the partitioned acyclic data        structure;    -   for a memory location which stores data representing a given        pointer of the partitioned acyclic data structure, the computer        processor defining (at a step 430) a period of exclusive access        to at least that memory location by applying and subsequently        releasing an exclusive tag for at least that memory location;        and    -   the computer processor selectively processing (at a step 440)        the given pointer during the period of exclusive access in        dependence upon whether the function-call identifier of the        prevailing processing function instance is identical to the        function-call identifier stored in association with the        partitioned acyclic data structure.

The processing element 40 may implement the above method in response tothe execution of program instructions and/or microcode held by anon-transitory machine-readable storage medium which stores programinstructions which, when executed by a computer processor, cause thecomputer processor to perform the steps of the method of FIG. 4. Anexample of such a storage medium may be the memory arrangement 30 and/orthe main memory 80, when such an arrangement or memory is implemented asa non-transitory memory, or by a magnetic or optical disc, a flash RAM,a ROM or the like.

In at least some examples, the period of exclusivity is defined by theuse of load exclusive and complementary store exclusive (or clearexclusive) instructions relating to the memory location in question, andwithin that period of exclusivity, checking that the stored functioncall identifier has not changed (indicating that another function callhas not occurred since the process started).

In all of the examples given below, the process of defining a period ofexclusivity comprises the computer processor executing a load-exclusiveoperation to load from the memory location of the given pointer; and thecomputer processor subsequently executing one of: a store-exclusiveoperation to store a value to the memory location of the given pointer;or a clear-exclusive operation to clear the exclusive tag associatedwith at least the memory location of the given pointer.

The examples below provide pseudocode and flowchart representations ofvarious exemplary processes. In at least some instances, the pseudocodeand the flowchart show substantially (or exactly) the same process.Except where it is indicated that the underlying processes aredifferent, if there is any discrepancy between the logical flow of thepseudocode and that of the respective flowchart, this should be taken asindicative of different embodiments representing the same underlyingprocess.

EXAMPLE Push_Front

FIGS. 5A and B schematically illustrate a so-called push_frontoperation.

In the example shown, FIG. 5A shows the situation before the push_frontoperation and FIG. 5B shows the situation after the push_frontoperation.

Referring to FIG. 5A a head data item 500 contains a pointer 502 to afirst data item 510 in turn containing a pointer 512 to a second dataitem 520.

The push_front operation involves inserting a further data item 530between the head data item 500 and the previous first data item 510, sothat the pointer 502 has to be redirected (as a new value 502′) to pointto the location of the inserted data item 530, a pointer 532 of the dataitem 530 points to the location of the original data item 510, and thepointer 512 is unchanged (pointing to the next data item 520).

Note that other data items may be provided after the data item 520 inthe partitioned acyclic data structure but these are not shown forclarity of these particular diagrams.

In FIGS. 5A and 5B, a further data field 504 is shown as part of thehead data item 500. The field 504 is used to store a function callidentifier (or “Caller ID”) to be discussed below. The use of anoperation to store and subsequently re-check a function call identifiercan allow the process to ensure that another process (for example inresponse to an interrupt) has not been initiated in the meantime, andthe feature whereby the re-check of the function call identifier iswithin a load exclusive—store exclusive operation allows the assurancethat when (a) the function call identifier has not changed, and (b) thestore exclusive operation is successful, the push_front operation hasbeen carried out validly without inconsistent intervening operations byother processes. The use of the data field (such as 504) provides anexample of the computer processor storing the function-call identifierin the memory at a storage location associated with a first data item inthe set of linked data items. Note however that it is not necessary tostore the function-call identifier as at least a part of (as in thisexample) or even in association with the first data item; it could bestored in an independent location or register. This however provides aconvenient and easily accessible location for storing and subsequentlychecking this item of information.

The push_front operation will now be described with reference to apseudocode example, the example being based around a “do . . . until”loop, by which the steps 1-6 of the example are repeated as successiveseries until the condition (defined following the “Until” statement) ismet, at which time the process ends. Note that other iterativeconditional loop formulations could be used with equivalent effect, suchas “while” loops, “do . . . while” loops or “goto” loops (examples ofthis being given below). Note that this (and other examples below usinga “do . . . until” or a “goto” formulation) provides an example of thecomputer processor iteratively performing the defining step and theselective processing step for successive pointers associated withsuccessive data items of the set of linked data items.

Do:

-   -   5.1. Set the Caller ID in the field 504 to the current stack        pointer;    -   5.2. Write the head pointer 502 into the “next” pointer 532 of        the new element 530;    -   5.3. Read the head pointer 502 (using a load exclusive        operation);    -   5.4. Check that the head pointer 502 hasn't changed with respect        to the value accessed at step 5.2; if not, return to 5.1;    -   5.5. Check that Caller ID in the field 504 is still the current        stack pointer; if not, return to 5.1;    -   5.6. Write the address of the new element 530 into the head        pointer as a new value 502′ (using a store exclusive operation);        Until the store is successful.

Note that the step 5.5 (and the conditional progress to step 5.6 as aresult of step 5.5) provides an example of the computer processormodifying the given pointer when the function-call identifier of theprevailing processing function instance is identical to thefunction-call identifier stored in association with the partitionedacyclic data structure; and the computer processor inhibitingmodification of the given pointer when the function-call identifier ofthe prevailing processing function instance is different to thefunction-call identifier stored in association with the partitionedacyclic data structure.

A flowchart representation will now be described with reference to FIG.5C. Respective notation used in the pseudocode and flowcharts includesthe following:

Pseudocode Flowchart next pointer of current element Next

FIG. 5C provides a schematic flowchart indicative of the push_frontoperation, which starts at a step 550. At a first functional step 552,the current stack pointer is stored to the Caller ID field, representingthe step 5.1 discussed above. Control passes to a step 554 at which thehead pointer is stored to the next pointer of the new element,corresponding to the step 5.2 discussed above.

Note that these steps are performed in so-called open access, incontrast to other steps performed under exclusive access. Transitionsbetween open access and exclusive access are indicated by arrows passingbetween a box 551 representing open access operations and a box 553representing exclusive access operations. A similar notation fordistinguishing open and exclusive access operations will be used inrespect of other flowcharts discussed below.

From the step 554, control passes to a step 556 at which exclusiveaccess is initiated to the head pointer, for example by reading the headpointer using an exclusive load operation as mentioned in the step 5.3of the pseudocode.

A step 558 involves comparing the value of the head pointer read at thestep 556 to the next pointer of the new element. If these are equal, asdetected at a step 560, then this results in a positive outcome of thecheck at the step 5.4 in the pseudocode. Control then passes to a step562 at which the current stack pointer is compared to Caller ID . Ifthese are equal, as detected at a step 564, this corresponds to apositive outcome of the step 5.5 in the pseudocode.

If either of the tests 560 or 564 show an inequality, this correspondsto a negative outcome of the checks at the respective step 5.4 or 5.5 ofthe pseudocode and control passes to a step 568 at which exclusiveaccess to the head pointer is ended and control returns to a step 552.The return to the step 552 represents a continuation of the “Do . . .Until” loop of the pseudocode.

Returning to the positive outcome of the step 564, at a step 566 theaddress of the new element, is written to the head pointer as a storeexclusive operation and, at a step 570, exclusive access to the headpointer is ended.

Control returns to the open access portion 551, and if the store at thestep 570 was successful, as detected at a step 572, then the processends at a step 574. If not, then control returns to the step 552, againrepresenting a continuation of the “Do . . . Until” loop of thepseudocode.

EXAMPLE Pop_Front

FIGS. 6A and 6B schematically illustrates a pop_front operation.Referring to the situation before the operation, in FIG. 6A, a head dataitem 600 and three successive data items 610, 620, 630 are shown(further data items may follow the data item 630 but are not shown forclarity of these diagrams). The chain of pointers is such that a pointer602 of the head data item points to the data item 610, a pointer 612points to the data item 620, a pointer 622 points to the data item 630and so on.

The pop_front operation involves removing or “popping” the first dataitem 610 from the front of the linked list or partitioned acyclic partof the data structure, so that the outcome after the operation as shownin FIG. 6B is that the new first data item is the data item 620 so thatthe pointer 602′ must now point to the location of the data item 620.The pointer 622 is unchanged in that it still points to the location ofthe data item 630.

A pseudocode example will now be provided, again using a “Do . . .until” loop of the steps 6.1-6.6:

Do:

-   -   6.1. Set the Caller ID field 604 to the current stack pointer;    -   6.2. Read the head pointer 602 (using a load exclusive        operation);    -   6.3. Check that Caller ID field 604 still contains the current        stack pointer; if not, return to step 6.1    -   6.4. Check that the head pointer 602 is not NULL;    -   6.5. Load the first element 610 using the head pointer 602;    -   6.6. Write the new head pointer 602′ with the next pointer 612        of the current element 610 (using a store exclusive operation);        Until the store is successful.

Note that as before, the step 6.3 (and the conditional progress to step6.4 and beyond as a result of step 6.3) provides an example of thecomputer processor modifying the given pointer when the function-callidentifier of the prevailing processing function instance is identicalto the function-call identifier stored in association with thepartitioned acyclic data structure; and the computer processorinhibiting modification of the given pointer when the function-callidentifier of the prevailing processing function instance is differentto the function-call identifier stored in association with thepartitioned acyclic data structure.

A schematic flowchart representation shown in FIG. 6C relating to thepop_front operation starts at a step 650 in the open access domain. At astep 652, the current stack pointer is stored to Caller ID,corresponding to the step 6.1 of the pseudocode. Control then passesinto the exclusive access domain, in that at a next step 654, exclusiveaccess is started to the head pointer, in this example by reading thehead pointer using a load exclusive operation. This corresponds to thestep 6.2 in the pseudocode.

At a step 656, the current stack pointer is compared to Caller ID,corresponding to the step 6.3 in the pseudocode. If these are equal, asdetected at a step 658, then control passes to a step 660, representingthe positive outcome of the step 6.3 in the pseudocode. If not,representing the negative outcome of the step 6.3 in the pseudocode,control passes to the step 659 at which exclusive access is ended to thehead pointer and control returns to the step 652. This provides anexample of a continuation of the “Do . . . Until” loop of thepseudocode.

Returning to the positive outcome of the step 658, at a step 660, thehead pointer is compared to a NULL value, corresponding to the step 6.4in the pseudocode. Noting that the pseudocode step 6.4 is in fact acheck that the head pointer is not NULL, the affirmative outcome of thistest is represented by the “no” output of the comparison step 652, whichpasses control to a step 670 at which a return value is set to the headpointer, corresponding to the step 6.5 in the pseudocode. Then, at astep 672, Next is set to the next pointer of the first element. Controlpasses to a step 668 involving an exclusive store of Next to the headpointer. These processes correspond to the step 6.6 in the pseudocode.At a step 674 exclusive access is ended to the head pointer and,assuming the store is successful as detected at a step 676, the processends at a step 678 (if not, then as a further continuation of the “Do .. . Until” loop, control returns to the step 652).

Returning to the “yes” outcome of the step 662, representing a failureof the test at the pseudocode step 6.4, both return and Next are set toNULL at respective steps 664 and 668 before control follows the path ofthe steps 668, 674, 676 as before.

EXAMPLE Insert

FIGS. 7A and 7B schematically represent an “insert” operation, onceagain with FIG. 7A representing the situation before the operation andFIG. 7B representing the situation after the operation.

Referring to FIG. 7A, a head data item 700 has a pointer 702 to a firstdata item 710 having a pointer 712 to a second data item 720 which inturn has a pointer 722 to the location of a third data item 730. Asbefore, further data items may be provided after the second data item730.

The insert operation involves inserting a data item into the partitionedacyclic data structure, at a position other than that of the first dataitem or the last data item. For example, a data item 740 having apointer 742 is inserted between the data items 710 and 720. To implementthis, the pointer 702 is unchanged, the pointer 712 is amended so as topoint to the location of the inserted data 740. The pointer 742 has topoint to the location of the data item 720. The pointer 722 isunchanged.

A pseudocode example will now be provided, involving the successivesteps 7.1-7.9 listed below, involving a conditional branchinginstruction at the steps 7.7 and 7.8. An insert target is defined, whichis (in this example) the data item 720, which is to say the element infront of which the “new element” (740 in this example) is to beinserted.

-   -   7.1. Set the Caller ID field 704 to the current stack pointer;    -   7.2. Set the current_element to the element pointed to by the        head pointer 702;    -   7.3. If the current_element is NULL, exit with error;    -   7.4. Load the next element pointer from the current_element;    -   7.5. Set the next pointer 742 of the new element to be equal to        the next pointer of the current_element;    -   7.6. Load the next pointer of the current_element (using a load        exclusive);    -   7.7. If the Caller ID is not the current stack pointer, go back        to 7.1;    -   7.8. If the current_element is not the insert target 720 then        set current_element=next element pointed to by current_element        and go to 7.3;    -   7.9. Set the next pointer of current_element to the address of        the new element 740 (using a store exclusive).

In this pseudocode, the steps 7.6 and 7.9, encompassing the step 7.7,ensure that the function call identifier is still the same as when theprocess started, and because this check is inside a load exclusive—storeexclusive loop, a successful store implies that nothing else has writtento the next pointer of the current_element in the meantime. Note thatthe step 7.9 will be reached only when the current_element is the inserttarget 720.

FIG. 7C provides a schematic flowchart indicative of an example of theinsert operation.

Note that the pseudocode shown above relates to a simple insertoperation at a list position established in advance, whereas theflowchart relates to another, slightly different, example of an orderedor priority-based insert operation. In this example, each elementincluding the element 740 to be inserted has an associated “priority”value or attribute (which could be, for example, an integer numericalvalue). In the process to be described below, at each step through thelist (starting from, for example, the head or first element), thepriority value of the new or inserted element 740 is compared with thepriority values within the existing list. Various examples are possible.

In one arrangement involving a descending priority, the new element 740should be inserted before an element having a lower priority value thanthe new element 740. Such an example (with reference to FIGS. 7A and 7B)might be:

Element in FIG. 7A Priority 710 9 720 3 730 1

Element in FIG. 7B Priority 710 9 740 [inserted] 5 720 3 730 1

In another example involving an ascending priority, the new element 740should be inserted before an element having a greater priority than theinserted element. Such an example (again with reference to FIGS. 7A and7B) might be:

Element in FIG. 7A Priority 710 1 720 7 730 9

Element in FIG. 7B Priority 710 1 740 [inserted] 5 720 7 730 9

Referring to the flowchart, after starting at a step 750, at a firstfunctional step 752, the current stack pointer is stored to the CallerID field. Control passes to a step 754 at which the current element isset to the reference head pointer.

From the step 754, control passes to a step 758 which involves settingthe next pointer of the new element to the value of the next pointer ofthe current element. That way, if the new element is inserted at thelist position currently under consideration, it will have the correctnext pointer for its inserted location. Note that this applies even ifthe current element is the last element in the list (having a nextpointer of NULL).

Control then passes to a step 756 at which exclusive access is initiatedto the next pointer of the current element, for example by reading thehead pointer using an exclusive load operation.

At a step 760 the current stack pointer is compared to Caller ID. Ifthese are equal, as detected at a step 762, then the process can safelycontinue. If not then exclusive access to the head pointer is ended at astep 786 and control returns to a step 752.

Returning to the positive outcome of the step 762, at a step 764 thenext pointer of the current element is compared to NULL (i.e. is thisthe end of the list). If it is, and given that the new element has notyet been inserted (by virtue of the process having continued to thispoint) then the new element is inserted after the current element by astep 772 storing the new element address to the next pointer of thecurrent element and a step 776 ending exclusive access to the nextpointer of the current element. If the store at the step 772 wassuccessful, as detected at a step 782, then the process ends at a step784. If not, then control returns to the step 752, again representing acontinuation of a “Do . . . Until” loop.

Returning to the step 766, if the next pointer of the current elementwas not NULL then control passes to a step 786 at which the prioritytest discussed above is performed (note that the priority test was notneeded in the outcome discussed above where the current element was atthe end of the list, as there was nowhere else left to insert the newelement). The example of the priority test shown in FIG. 7C isapplicable to an ascending priority system, in that at the step 768 thenew element's priority is compared to the priority of the next elementpointed to by the current element.

If, at a step 770, the priority of the new element 740 is less than thatof the next element pointed to by the current element, then the newelement is inserted by the control path involving the steps 772 onwardsas discussed above. This represents an example of the ascending priorityarrangement discussed above. If not then the loop operation continuesthrough the list by a step 778 ending exclusive access to the nextpointer of the current element and a step 780 setting as a replacement“current element” the element referenced by the next pointer of thecurrent element, before continuing a next iteration at the step 756.

Referring to the ascending priority example given above where the newelement 740 has a priority of 5, the loop might progress as a firstiteration in which the current element 710 has priority 1, and the nextelement 720 pointed to by current element has priority 7. The test atthe step 770 detects that the new element 740 has a lower priority thanthe next element 720 and so control passes to the step 772 to insert thenew element 740 after the current element 710.

EXAMPLE Delete

FIGS. 8A and 8B schematically illustrate the “before” and “after”situations for a so-called “delete” operation in which a data item otherthan the first or last data item is deleted or removed from thepartitioned acyclic data structure.

Referring to FIG. 8A, a head data item 800 has a pointer 802 to a firstdata item 810 of which the pointer 812 points to a second data item 820.The pointer 822 of the second data item points to a third data item 830having a pointer 832 to a fourth data item 840. As before, further dataitems may be provided in the structure after the data item 840 but theseare omitted from the diagram for clarity of the explanation.

Assume that the delete operation involves deleting the data item 820 asa “deletion target”. To achieve this, the pointer 802 is unchanged, butthe pointer 812 must be amended to a new value 812′ so as to point tothe location of the data item 830. The pointer 832 is unchanged.

A pseudocode example will now be given.

-   -   8.1. Set the Caller ID field 804 to the current stack pointer;    -   8.2. Set the current_element to the head element 800;    -   8.3. Load the next pointer from the current_element (using a        load exclusive);    -   8.4. If the Caller ID field 804 does not contain the current        stack pointer, go back to 8.1;    -   8.5. If the loaded next pointer was NULL, exit with error;    -   8.6. If the next element pointed to by the next pointer of the        current_element does not match the deletion target, set        current_element=the next element pointed to by the        current_element and go to 8.3;    -   8.7. (note that this step is reached only when the next element        pointed to by the current_element is the deletion target): Load        the next pointer from the data item pointed to by the next        pointer of current_element. In the example of FIGS. 8a and 8 b,        this stage is reached when the current_element is 810, the        deletion target 820 is pointed to by the current_element's        pointer 812, so the step 8.7 involves loading the pointer 822 of        the deletion target 820;    -   8.8. Set the next pointer of current_element to the pointer        loaded in step 8.7 (that is to say, in the example, set the        pointer 812′ to the previous value of the pointer 822, that is        to say a pointer to the element 830) (using a store exclusive);    -   8.9. If the store exclusive failed, go to 8.1;    -   8.10. Clear exclusive the next pointer of the deletion target.

Note that the test for the deletion target at step 8.6 (and similarfunctions discussed in the other examples) provides an example in whichin which execution of the processing function instance to modify one ormore pointers of the partitioned acyclic data structure is configured tomodify a particular pointer of the partitioned acyclic data structure,the method comprising the step of: the computer processor detecting,during the period of exclusive access, whether the memory locationsubject to exclusive access stores data representing the particularpointer to be modified.

A further possible refinement with reference to the “delete” operationdiscussed above (and which may be relevant to the “pop” operations alsodiscussed) is as follows. Assuming that exclusivity is granted by memoryregion, in a system where at least two elements reside in differentexclusive access regions AND one of these elements contains a pointer toan element in the other region AND an insert is in progress, with theCaller ID already checked AND it is interrupted by a delete of theelement that the inserted element would follow, the insert will not failon store exclusive due to the fact that it is not in the same exclusiveaccess region.

Suppose A→B

Start inserting C after B

Interrupt with Delete B (this operates on the next pointer of A)

Resume inserting C

The final state is:

A

B→C

But the desired state is:

A→C

B

One way to provide the desired output state as that when an element isremoved from the partitioned acyclic data structure an instruction isexecuted to STREX NULL (store exclusive a NULL pointer) to the “next”pointer 822 of the deleted item 820. In the above pseudocode, this wouldoccur as stage 8.10 as listed. This provides an example, in the case ofa pointer associated with a data item to be deleted, in which thecomputer processor is configured to execute a store-exclusive operationto store a null value to the memory location of the given pointer.

A schematic flowchart representation is provided in FIG. 8C and startsat a step 850 from which control passes to a step 852 at which thecurrent stack pointer is stored to Caller ID, corresponding to the step8.1 in the pseudocode. Staying within the open access domain, controlpasses to a step 854 at which the current element is set to thereference head pointer, corresponding to the step 8.2 in the pseudocode.Control then moves into the exclusive access domain in which, at a step856, exclusive access is started to the next pointer of the currentelement, for example by an exclusive load operation, corresponding tothe step 8.3 of the pseudocode.

At a step 858, the current stack pointer is compared to the Caller IDfield. If these are equal, as detected at a step 860, this correspondsto a positive outcome of the step 8.4 in the pseudocode and controlpasses to a step 862. If not, control passes to a step 864 at whichexclusive access to the next pointer of the current element is ended andcontrol returns to the step 852.

Returning to the step 862, the next pointer of the current element iscompared to a NULL value. This represents the test performed at step 8.5of the pseudocode. If these are detected to be equal at a step 865, thenthe process exits with error, represented by steps 866 at which Returnis set to NULL and 868 at which exclusive access is ended to the nextpointer of the current element before control passes to the end 870 ofthe process with an error.

However, if the test of the pseudocode step 8.5 is passed (the loadednext pointer was not NULL, representing the negative outcome of the step865), then control passes to a step 872 at which the test in thepseudocode step 8.6 is carried out, namely whether the next elementpointed to by the next pointer of the current element matches thedeletion target or not. Here, a match is indicated by a positive outcometo an equality test 874, which takes control to a step 876,corresponding to the step 8.7 of the pseudocode, at which the variableNext is set to the next pointer of the deletion target's data. At a step878, corresponding to the step 8.8 of the pseudocode, the variable Nextis stored to the next pointer of the current element using a storeexclusive operation, exclusive access is ended at a step 880, andcontrol passes to a step 882 from which, if the store was successful,control passes to a step 884 at which the next pointer of the deletiontarget is set to NULL and, at a step 886, exclusive access is ended forthe next pointer of the deletion target and (at a step 887) the returnvalue is set to the target before the process ends at the step 870.

If however, at the step 882, the store was not successful, then(corresponding to the step 8.9 of the pseudocode) control returns to thestep 852.

Returning to the step 874, if the next element pointed to by the nextpointer of the current element does not match the deletion target (theno outcome of the step 874) then control passes to a step 877 at whichthe process moves on to the following element to perform the same testsby setting Next to the next pointer of the current element, ending (at astep 879 exclusive access to the next pointer of the current element andsetting (at a step 881) the new current element to be that defined bythe Next variable. This corresponds to the negative outcome of the step8.6 in the pseudocode.

EXAMPLE Push_Back

FIGS. 9A and 9B schematically illustrate a so-called push_backoperation, with FIG. 9A showing the situation before the operation andFIG. 9B showing the situation after the operation.

Referring to FIG. 9A, a head data item 900 has a pointer 902 to a firstdata item 910 which in turn has a pointer 912 to a second data item 920.The pointer 922 of the second data item points to a last or end dataitem 930 which, in place of a pointer has a NULL indicator or flag 932to show that it is the last data item in the particular data structureunder discussion.

The push_back operation involves adding a further data item after theprevious end of the partitioned acyclic data structure of FIG. 9A,namely a new last or end data item 940. To achieve this, the data items900, 910, 920 and their respective pointers are unchanged. The new valueof the pointer field 932′ of the data item 930 no longer indicates alast data item but instead points to the location of the new last dataitem 940, of which a pointer field 942 indicates that the data item 940is now the last data item. Assume that a new element 940 has beenprepared and has a NULL pointer 942.

A pseudocode example will now be given.

-   -   9.1. Set the Caller ID field 904 to the current stack pointer;    -   9.2. Set the current_element to the head element 900;    -   9.3. Load the next pointer from the current_element (using a        load exclusive);    -   9.4. If the Caller ID field 904 does not contain the current        stack pointer, go back to 9.1;    -   9.5. If the next pointer loaded at step 9.3 was NULL (indicating        that the current_element is the element 930 at the end of the        list in FIG. 9a ), set the next pointer of the current element        to the address of the new element (using a store exclusive) and        exit    -   9.6. If the store exclusive failed, go to 9.1.    -   9.7. (assuming that the current_element wasn't the end of the        list at the step 9.5) set current_element=next element pointed        to by the current_element and go to 9.3.

A schematic flowchart relating to the push_back operation is provided inFIG. 9C and starts at a step 950. At a step 952, the next pointer of thenew element to be inserted is initialised to NULL. Then, at a step 954,corresponding to the step 9.1 of the pseudocode, the current stackpointer is stored to Caller ID. At a step 956, corresponding to the step9.2 of the pseudocode, the current element is set to reference the headpointer and control moves into the exclusive access domain in that, at astep 958, exclusive access is started to the next pointer of the currentelement, for example by loading that pointer using a load exclusiveoperation.

Then, at a step 960, the current stack pointer is compared to Caller ID.If the two are equal, as detected at a step 962, corresponding to apositive outcome of the step 9.4 of the pseudocode, control passes to astep 964 at which the next pointer of the current element is compared toNULL. If these are equal as detected at a step 966, then control passesto a step 968 at which a store exclusive operation is performed to setthe next pointer of the current element to the address of the newelement. Exclusive access to the next pointer of the current elementends at a step 970 and control passes to a detection step 972 to detectwhether the store was successful. If yes, then the process ends at astep 974.

Note that the positive outcome of the step 966 corresponds to a positiveoutcome of the test of the step 9.5 of the pseudocode. The negativeoutcome of the step 966 corresponds to a failure of the test at 9.5 ofthe pseudocode and control is passed to a step 978 at which exclusiveaccess is ended to the next point of the current element before controlis returned to the main loop by executing a step 980 at which thecurrent element is set to the next element pointed to by the currentelement and control returns to another iteration at the step 958.

Returning to the step 972, if the store was unsuccessful, then controlreturns to the step 954 to repeat the entire process.

EXAMPLE Pop_Back

FIGS. 10A and 10B schematically represent “before” and “after”situations respectively for a so-called pop_back operation in which thecurrent last or end data item in the partitioned acyclic data structureis popped or deleted.

Referring to FIG. 10A, a head data item 1000 has a pointer 1002 to afirst data item 1010, to which the pointer 1012 points to a second dataitem 1020 having a pointer 1022 to a third data item 1030 of which thepointer 1032 points to the last data item 1040 having an indicator 1042(instead of a pointer) showing that this is the last data item in thepartitioned acyclic data structure.

In order to implement the pop_back operation, no change is required tothe data items 1000, 1010, 1020. However, the pointer field 1032 of thenew last or end data item 1030 has to be changed so that it no longerpoints to the data item 1040 (which no longer exists in this particulardata structure) but instead indicates that the data item 1030 is thelast data item in the structure.

A pseudocode example will now be provided.

-   -   10.1. Set the Caller ID field 1004 to the current stack pointer;    -   10.2. Set the current_element to the head element 1000;    -   10.3. Load the next pointer from the current_element (using a        load exclusive);    -   10.4. If the Caller ID does not contain the current stack        pointer, go back to 10.1;    -   10.5. If the next pointer loaded at step 10.3 was NULL, exit        with error;    -   10.6. Load the next pointer of the element pointed to by the        current_element;    -   10.7. If the pointer loaded at step 10.6 is not NULL, set        current_element=the element pointed to by the current_element        and go to 10.3.    -   10.8. (note that steps 10.8 and 10.9 occur only if        current_element is now the penultimate element 1030 in FIG. 10a        ) Set return=the next pointer of the current_element;    -   10.9. Set the next pointer 1032 of the current element 1030 to        NULL to indicate the new end of the list (store exclusive)    -   10.10. If the store exclusive failed, go to 10.1.    -   10.11. Return return (as the location of the deleted item, if        required)

A representation will now be described with reference to FIG. 10C, whichprovides a schematic flowchart of the pop_back process, starting at aprocess step 1050 from which control passes to a step 1052 correspondingto a step 10.1 of the pseudocode in which the current stack pointer isstored to Caller ID.

Control passes to a step 1053 at which the next pointer of the headelement is compared to NULL (i.e. is the list empty?). If, at a step1054, the outcome is positive, a return value is set to NULL at a step1055 and the process ends at a step 1056.

However, assuming the test of the step 1054 has a negative outcome,control passes to a step 1058 at which the current element is set to thehead element corresponding to the step 10.2 of the pseudocode. Theprocess flow then moves into the exclusive access domain.

At a step 1060, corresponding to the step 10.3 of the pseudocode,exclusive access is started to a next pointer of the current element,for example by loading that pointer of a load exclusive operation. At astep 1062, the current stack pointer is compared to Caller ID. If theseare equal at a step 1064, corresponding to a positive outcome of thestep 10.4 of the pseudocode, control passes to a step 1066. If not,control passes to a step 1068 at which exclusive access is ended to thenext pointer of the current element and control returns to the step1052, corresponding to the negative outcome of the step 10.4 of thepseudocode.

At the step 1066, the next pointer of the current element is compared toNULL. If these are equal as detected at a step 1070, then control passesto the step 1068 for another iteration of the program loop. However, ifthe next pointer of the current element is not NULL then control passesto a step 1072 at which Next is set to the next pointer of the currentelement.

At a step 1074, the next pointer of the next element is compared toNULL. If it is NULL, as detected at a step 1076 and indicating that thenext element is the last in the list, then a return value is set to Nextat a step 1078, at a step 1080 NULL is stored to the next pointer of thecurrent element using a store exclusive operation and at a step 1082,exclusive access is ended to the next pointer of the current element.

Assuming, at a step 1084 that the store was successful, the process endsat the step 1066.

If the store was not successful at the step 1084 then control passes tothe step 1052 again.

Returning to the step 1076, assuming that the next pointer of the nextelement was not NULL, then control passes to a step 1090 at whichexclusive access to the next pointer of the current element has endedand, at a step 1092, the current element is advanced by one beforecontrol returns to the step 1060, corresponding to the positive outcomeof the test at the step 10.7 in the pseudocode.

FIG. 11 schematically illustrates a non-transitory machine-readablestorage medium 1100 which stores a partitioned acyclic data structurecomprises a set of linked data items, each data item comprising a memorylocation to store data representing a pointer to a next data item in thepartitioned acyclic data structure; and which provides a data field 1110associated with the partitioned acyclic data structure to store afunction-call identifier of an instance of a processing function inresponse to initiation of execution of that processing functioninstance. The non-transitory machine-readable storage medium may beimplemented by the memory arrangement 30 and/or the main memory 80, orby another storage medium such as a magnetic or optical disc or anon-transitory electronic memory such as a flash RAM or a ROM.

The processing element 40 and/or the apparatus 20 of FIG. 1, whenconfigured to perform the method of FIG. 4, provides an example of adata processor comprising:

processing circuitry configured, under the control of a set ofprocessing instructions, to perform the steps of:

executing instances of one or more processing functions, each instanceof a processing function having an associated function-call identifier;and

in response to initiation of execution of a given processing functioninstance configured to modify one or more pointers of a partitionedacyclic data structure:

-   -   storing the function-call identifier for that processing        function instance in association with the partitioned acyclic        data structure;    -   for a memory location storing data representing a given pointer        of the partitioned acyclic data structure, defining a period of        exclusive access to at least that memory location by applying        and subsequently releasing an exclusive tag for at least that        memory location; and    -   selectively processing the given pointer during the period of        exclusive access in dependence upon whether the function-call        identifier of the prevailing processing function instance is        identical to the function-call identifier stored in association        with the partitioned acyclic data structure.

In the present application, the words “configured to . . . ” are used tomean that an element of an apparatus has a configuration able to carryout the defined operation. In this context, a “configuration” means anarrangement or manner of interconnection of hardware or software. Forexample, the apparatus may have dedicated hardware which provides thedefined operation, or a processor or other processing device may beprogrammed to perform the function. “Configured to” does not imply thatthe apparatus element needs to be changed in any way in order to providethe defined operation.

Although illustrative embodiments of the present techniques have beendescribed in detail herein with reference to the accompanying drawings,it is to be understood that the present techniques are not limited tothose precise embodiments, and that various changes, additions andmodifications can be effected therein by one skilled in the art withoutdeparting from the scope and spirit of the techniques as defined by theappended claims. For example, various combinations of the features ofthe dependent claims could be made with the features of the independentclaims without departing from the scope of the present techniques.

1. A computer-processor-implemented data processing method comprising: acomputer processor executing instances of one or more processingfunctions, each instance of a processing function having an associatedfunction-call identifier; and in response to initiation of execution bythe computer processor of a given processing function instanceconfigured to modify one or more pointers of a partitioned acyclic datastructure: the computer processor storing the function-call identifierfor that processing function instance in a memory at a storage locationassociated with the partitioned acyclic data structure; for a memorylocation which stores data representing a given pointer of thepartitioned acyclic data structure, the computer processor defining aperiod of exclusive access to at least that memory location by applyingand subsequently releasing an exclusive tag for at least that memorylocation; and the computer processor selectively processing the givenpointer during the period of exclusive access in dependence upon whetherthe function-call identifier of the prevailing processing functioninstance is identical to the function-call identifier stored inassociation with the partitioned acyclic data structure.
 2. A methodaccording to claim 1, in which the selective processing step comprises:the computer processor modifying the given pointer when thefunction-call identifier of the prevailing processing function instanceis identical to the function-call identifier stored in association withthe partitioned acyclic data structure; the computer processorinhibiting modification of the given pointer when the function-callidentifier of the prevailing processing function instance is differentto the function-call identifier stored in association with thepartitioned acyclic data structure.
 3. A method according to claim 1, inwhich the defining step comprises: the computer processor executing aload-exclusive operation to load from the memory location of the givenpointer; and the computer processor subsequently executing one of: astore-exclusive operation to store a value to the memory location of thegiven pointer; or a clear-exclusive operation to clear the exclusive tagassociated with at least the memory location of the given pointer.
 4. Amethod according to claim 1, in which the partitioned acyclic datastructure comprises a set of linked data items, each data itemcomprising a memory location to store data representing a pointer to anext data item in the partitioned acyclic data structure.
 5. A methodaccording to claim 4, in which the storing step comprises the computerprocessor storing the function-call identifier in the memory at astorage location associated with a first data item in the set of linkeddata items.
 6. A method according to claim 5, in which the storing stepcomprises the computer processor storing the function-call identifier asat least a part of the first data item in the set of linked data items.7. A method according to claim 4, in which the function-call identifierfor a processing function instance comprises one or more identifiersselected from the list consisting of: a processor stack pointerassociated with that processing function instance; an identifier of amemory context allocated to that processing function instance; a programcounter value dependent upon an entry point of that processing function;and a thread identifier combined with an interrupt identifier.
 8. Amethod according to claim 4, comprising the step of the computerprocessor iteratively performing the defining step and the selectiveprocessing step for successive pointers associated with successive dataitems of the set of linked data items.
 9. A method according to claim 8,in which execution of the processing function instance to modify one ormore pointers of the partitioned acyclic data structure is configured tomodify a particular pointer of the partitioned acyclic data structure,the method comprising the step of: the computer processor detecting,during the period of exclusive access, whether the memory locationsubject to exclusive access stores data representing the particularpointer to be modified.
 10. A method according to claim 1, in which thedefining step comprises the computer processor applying and subsequentlyreleasing an exclusive tag a range of memory locations including atleast the memory location for the given pointer.
 11. A method accordingto claim 3, in which, in the case of a pointer associated with a dataitem to be deleted, the computer processor is configured to execute astore-exclusive operation to store a null value to the memory locationof the given pointer.
 12. A non-transitory machine-readable storagemedium which stores program instructions which, when executed by acomputer processor, cause the computer processor to perform the steps ofa method comprising: executing instances of one or more processingfunctions, each instance of a processing function having an associatedfunction-call identifier; and in response to initiation of execution ofa given processing function instance configured to modify one or morepointers of a partitioned acyclic data structure: storing thefunction-call identifier for that processing function instance inassociation with the partitioned acyclic data structure; for a memorylocation storing data representing a given pointer of the partitionedacyclic data structure, defining a period of exclusive access to atleast that memory location by applying and subsequently releasing anexclusive tag for at least that memory location; and selectivelyprocessing the given pointer during the period of exclusive access independence upon whether the function-call identifier of the prevailingprocessing function instance is identical to the function-callidentifier stored in association with the partitioned acyclic datastructure.
 13. A data processor comprising: processing circuitryconfigured, under the control of a set of processing instructions, toperform the steps of: executing instances of one or more processingfunctions, each instance of a processing function having an associatedfunction-call identifier; and in response to initiation of execution ofa given processing function instance configured to modify one or morepointers of a partitioned acyclic data structure: storing thefunction-call identifier for that processing function instance inassociation with the partitioned acyclic data structure; for a memorylocation storing data representing a given pointer of the partitionedacyclic data structure, defining a period of exclusive access to atleast that memory location by applying and subsequently releasing anexclusive tag for at least that memory location; and selectivelyprocessing the given pointer during the period of exclusive access independence upon whether the function-call identifier of the prevailingprocessing function instance is identical to the function-callidentifier stored in association with the partitioned acyclic datastructure.
 14. A non-transitory machine-readable storage medium whichstores a partitioned acyclic data structure comprises a set of linkeddata items, each data item comprising a memory location to store datarepresenting a pointer to a next data item in the partitioned acyclicdata structure; and which provides a data field associated with thepartitioned acyclic data structure to store a function-call identifierof an instance of a processing function in response to initiation ofexecution of that processing function instance.